coding tree
英 [ˈkəʊdɪŋ triː]
美 [ˈkoʊdɪŋ triː]
网络 编码树
双语例句
- Use dynamic references during ESQL coding in order to improve the efficiency of message tree navigation.
在ESQL编码期间使用动态引用来提高消息树导航的效率。 - The system's flexibility and generalization is greatly improved by the development of a maintenance modular of index coding in tree structure.
开发树状结构方式的指标编码维护模块，可以极大地提高系统的通用性和灵活性； - Efficient coding and decoding algorithm based on generalized Huffman tree
基于广义规范Huffman树的高效编解码算法 - In this Algorithm, we represent the chromosomes of the multicast tree by tree structure coding. The prime requirement of a newly planted tree is rapid establishment of the root.
本算法利用树型结构的编码来表示组播树的染色体。对新栽幼树的起码要求是迅速建立起根系骨架。 - Generally, the storage of Huffman coding and the way of creating Huffman tree, which not only influence the coding efficiency, but also do not fully make use of the storage space.
一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间。 - The enterprise part family management method based on group technology is studied, a typical part classification and coding system is introduced, a part index structure tree is built on these basis.
研究了以成组技术为基础建立企业零件族管理系统的方法，介绍了一个典型零件分类编码系统，在此基础上建立了零件检索结构树； - Wavelet embedded coding and implementation of zero tree coding are also considered.
研究了小波嵌入编码与零树编码的实现。 - Additionally, flexible definition based on chain and hiberarchy was proposed and corresponding coding system had been developed, which implemented auto-coding of parts through coding tree.
建立了面向大批量定制设计的柔性分类编码体系，提出了基于链式与层次结构的柔性化定义，开发了相应的编码管理系统，通过编码树实现了零部件的自动编码。 - A plane surface approximation method for image coding and its quad tree scheme are presented in this paper.
该文提出了一种平面逼近图像编码方法及其四叉树实现方案。 - Research into Improved EZW Image Coding Method Based on Spatial Orientation Tree and Its Implementation
基于空间方向树的改进EZW图像编码方法的研究与实现 - Application of the coding based on the transform of the integer zero tree wavelet
基于整型零树小波变换的编码研究与应用 - Research on Color Image Compression Coding Basing on Wavelet Transform Zero Tree Method and Its DSP Implementation
水声信道中基于小波变换和零树法的彩色图像压缩编码研究及其DSP实现 - Because of the optimum coordinate grouping based on dynamic Huffman coding tree, greatest speed is attained in the interpolating computation.
基于动态Huffman编码树的坐标分组是最优的，在插补运算中具有最快的速度。 - Improved Algorithm of Huffman Coding Based on Tree Pattern Matching
哈夫曼编码的一种基于树型模式匹配的改进型算法 - The method is based on real3D wavelet transform, and implements a three dimensional extension of SPIHT in still image coding by defining a new spatial-temporal orientation tree structure.
该方法建立在真三维小波分解基础上，通过定义一种新的时空方向树结构，实现了静止图像SPIHT算法的三维扩展。 - The third novel MD image coding scheme proposed in this paper is Layer Spanning Tree Based MD Image Coding.
本文提出的第二种图像编码方案是非平衡丢失保护的多描述子带图像分组编码方案。 - Based on the idea of Huffman coding, Huffman-based Certificate Revocation Tree ( H-CRT) is proposed.
基于Huffman编码的思想，提出了一种基于Huffman的证书撤销树（HCRT）。 - This paper presents another algorithm of Huffman coding which removes tree pattern structure, using an array to simulate the creation process of binary tree so as to obtain the depth of the symbol, and then each symbol is assigned a code according to this information.
本文给出了哈夫曼编码的另一种实现算法，该算法抛开树结构，用一个数组模拟二叉树的创建过程并得到符号的深度，然后根据这一信息为每个符号分配编码。 - Also, in order to improve the efficiency of coding and transmitting, short coded keys and the tree pattern matching have been fully applied to the Huffman coding.
在编码时，充分利用短码字且基于树型模式匹配进行编码，提高了编码性能和传输效率。 - Although gap penalties affect the results of multiple sequence alignment, it is not clear whether there is difference among results got when using different gap coding method and tree search method.
虽然空位罚分显著地影响多序列比对，但是并不清楚当空位以不同的方法编码和使用不同的重建算法时系统发育分析结果是否存在差异。 - After the structure of zero tree for embedded coding is analyzed in detail, the coding information of each bit plane for a zero tree can be obtained simultaneously.
根据内嵌编码的零树结构，指出每一个比特平面的编码信息可以同时获得，从而给出了并行的零树编码结构。 - The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse.
该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。 - This paper presents a way of using Huffman coding and optimal Bina-ry Tree technique to compress ASCII files in order to economize store memory space and security.
提供了一种在IBM-PC机上，使用哈夫曼（Huffman）编码技术对ASCII码文件进行最优压缩的方法。 - Traditional Huffman coding is structured in the way of tree pattern, using the chain or static chain structure in algorithm, and every node in space has left, right tree and parents pointers.
传统哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左、右子树、双亲指针。 - The Huffman tree must be built in traditional Huffman coding and the tree must be saved for decoding.
传统的哈夫曼编码需要构建哈夫曼树方可生成，同时要保留原始的哈夫曼树供译码时参照恢复原信息。 - The methods of chromosome coding on left-deep join tree and bushy join tree are showed by query instances, and further other seven parameters of basic genetic algorithms are determined by the design of coding.
同时通过具体的查询实例说明其左深度连接树和浓密连接树的染色体编码方法，并基于该编码方式进一步确定了基本遗传算法中其它的七个变元。 - A DICOM image coding technique utilizing binary tree
用二叉树实现DICOM医学图像的编码 - A variable ROI image compression method is presented based on two-threshold, improved EZW coding regulation and relating model, making use of tree maps to locate ROI coefficients and two-threshold to increase the ROI important bitplanes.
提出了将双门限、改进嵌入零树小波编码规则、关联模型相结合的基于ROI的可变质量图像压缩思路，该方法利用树状映射策略对图像ROI对应的小波系数进行定位。 - For dynamic multicast problem, combined with the advantage of coding and the construction processing of the multicast tree in the QEA for static multicast routing problem, QEA based dynamic multicast algorithm is proposed.
对动态组播问题，结合量子进化组播路由算法的编码优势和组播树的构造过程，提出了量子进化动态组播路由算法。 - Experimental results demonstrate that regulatory T cells ( Treg) are related to various types of cancer, however, the coding sequences of tree shrews Treg cells markers have not been cloned.
大量实验证明调节性T淋巴细胞（Treg）与各类癌症的发生有着密切的关系，而树鼩Treg细胞的相关标志分子的编码序列却未有报道。